Approximation Algorithms for Connected Dominating Sets
نویسندگان
چکیده
منابع مشابه
A greedy approximation for minimum connected dominating sets
Given a graph, a connected dominating set is a subset of vertices such that every vertex is either in the subset or adjacent to a vertex in the subset and the subgraph induced by the subset is connected.A minimum connected dominating set is such a vertex subset with minimum cardinality. In this paper, we present a new one-step greedy approximation with performance ratio ln + 2 where is the maxi...
متن کاملConstant-approximation algorithms for highly connected multi-dominating sets in unit disk graphs
Given an undirected graph on a node set V and positive integers k and m, a k-connected m-dominating set ((k,m)-CDS) is defined as a subset S of V such that each node in V \ S has at least m neighbors in S, and a k-connected subgraph is induced by S. The weighted (k,m)-CDS problem is to find a minimum weight (k,m)-CDS in a given node-weighted graph. The problem is called the unweighted (k,m)-CDS...
متن کاملImproved approximation algorithms for k-connected m-dominating set problems
A graph is k-connected if it has k internally-disjoint paths between every pair of nodes. A subset S of nodes in a graph G is a kconnected set if the subgraph G[S] induced by S is k-connected; S is an m-dominating set if every v ∈ V \ S has at least m neighbors in S. If S is both k-connected and m-dominating then S is a k-connected m-dominating set, or (k,m)-cds for short. In the k-Connected mD...
متن کاملConnected Dominating Sets
PROBLEM DEFINITION Consider a graph G = (V,E). A subset C of V is called a dominating set if every vertex is either in C or adjacent to a vertex in C. If, furthermore, the subgraph induced by C is connected, then C is called a connected dominating set. A connected dominating set with a minimum cardinality is called a minimum connected dominating set (MCDS). Computing a MCDS is an NP-hard proble...
متن کاملConnected Dominating Sets
Wireless sensor networks (WSNs), consist of small nodes with sensing, computation, and wireless communications capabilities, are now widely used in many applications, including environment and habitat monitoring, traffic control, and etc. Routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks like mobile ad hoc networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 1998
ISSN: 0178-4617,1432-0541
DOI: 10.1007/pl00009201